. An algorithm for the rapid evalution of special function transforms
نویسندگان
چکیده
We introduce a fast algorithm for the numerical application to arbitrary vectors of several special function transforms. The algorithm requires O(n log(n)) operations to apply to an arbitrary vector any n×n matrix such that the rank of any p×q contiguous submatrix is bounded by a constant times pq/n. These rank bounds are proven here for the case of the Fourier-Bessel transform. Numerical experiments demonstrate a much wider applicability. The performance of the algorithm is illustrated via several numerical examples.
منابع مشابه
Calculation of One-dimensional Forward Modelling of Helicopter-borne Electromagnetic Data and a Sensitivity Matrix Using Fast Hankel Transforms
The helicopter-borne electromagnetic (HEM) frequency-domain exploration method is an airborne electromagnetic (AEM) technique that is widely used for vast and rough areas for resistivity imaging. The vast amount of digitized data flowing from the HEM method requires an efficient and accurate inversion algorithm. Generally, the inverse modelling of HEM data in the first step requires a precise a...
متن کاملAutoconvolution equations and generalized Mittag-Leffler functions
This article is devoted to study of the autoconvolution equations and generalized Mittag-Leffler functions. These types of equations are given in terms of the Laplace transform convolution of a function with itself. We state new classes of the autoconvolution equations of the first kind and show that the generalized Mittag-Leffler functions are solutions of these types of equations. In view of ...
متن کاملForecasting Stock Market Using Wavelet Transforms and Neural Networks: An integrated system based on Fuzzy Genetic algorithm (Case study of price index of Tehran Stock Exchange)
The jamor purpose of the present research is to predict the total stock market index of Tehran Stock Exchange, using a combined method of Wavelet transforms, Fuzzy genetics, and neural network in order to predict the active participations of finance market as well as macro decision makers.To do so, first the prediction was made by neural network, then a series of price index was decomposed by w...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملMinimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...
متن کامل